YES 0.432 H-Termination proof of /home/matraf/haskell/eval_FullyBlown_Fast/Monad.hs
H-Termination of the given Haskell-Program with start terms could successfully be proven:



HASKELL
  ↳ BR

mainModule Monad
  ((join :: IO (IO a ->  IO a) :: IO (IO a ->  IO a)

module Monad where
  import qualified Maybe
import qualified Prelude

  join :: Monad b => b (b a ->  b a
join x x >>= id


module Maybe where
  import qualified Monad
import qualified Prelude



Replaced joker patterns by fresh variables and removed binding patterns.

↳ HASKELL
  ↳ BR
HASKELL
      ↳ COR

mainModule Monad
  ((join :: IO (IO a ->  IO a) :: IO (IO a ->  IO a)

module Maybe where
  import qualified Monad
import qualified Prelude


module Monad where
  import qualified Maybe
import qualified Prelude

  join :: Monad a => a (a b ->  a b
join x x >>= id



Cond Reductions:
The following Function with conditions
undefined 
 | False
 = undefined

is transformed to
undefined  = undefined1

undefined0 True = undefined

undefined1  = undefined0 False



↳ HASKELL
  ↳ BR
    ↳ HASKELL
      ↳ COR
HASKELL
          ↳ Narrow

mainModule Monad
  (join :: IO (IO a ->  IO a)

module Monad where
  import qualified Maybe
import qualified Prelude

  join :: Monad b => b (b a ->  b a
join x x >>= id


module Maybe where
  import qualified Monad
import qualified Prelude



Haskell To QDPs